computational complexity theory - PDFSEARCH.IO - Document Search Engine

computational complexity theory
Results: 2049

#	Item
671	Generating counterexamples for quantitative safety specifications in probabilistic B Ukachukwu Ndukwu1 Department of Computing, Macquarie University, NSW 2109 Sydney, Australia. Abstract Add to Reading List Source URL: web.science.mq.edu.au Language: English - Date: 2010-04-30 06:17:08 Probabilistic complexity theory Complexity classes Probabilistic Turing machine Turing machine PP NL Predicate transformer semantics IP Model checking Theoretical computer science Computational complexity theory Applied mathematics
672	Electronic Notes in Theoretical Computer ScienceURL: http://www.elsevier.nl/locate/entcs/volume45.html 31 pages A Probabilistic Polynomial-time Calculus For Analysis of Cryptographic Protocols (Preliminary Rep Add to Reading List Source URL: theory.stanford.edu Language: English - Date: 2002-09-12 20:15:55 Complexity classes Computability theory Models of computation Probabilistic complexity theory PP IP Oracle machine NP P Theoretical computer science Computational complexity theory Applied mathematics
673	Curriculum Vitæ (abridged) Luke Mathieson BSc BCompSc(Hons1) PGDipHEd MHEd PhD(Dunelm) Personal Details Add to Reading List Source URL: comp.mq.edu.au Language: English - Date: 2013-12-01 23:03:08 Parameterized complexity International Colloquium on Automata Languages and Programming Algorithm Symposium on Theoretical Aspects of Computer Science Michael Fellows Theoretical computer science Applied mathematics Computational complexity theory
674	CS109B Notes for LectureNP-Complete Problems We have met some problems that have \easy" solutions; they have algorithms that run in time that is polynomial in the size of the graph, the parameter m. Examples: Add to Reading List Source URL: infolab.stanford.edu Language: English - Date: 2008-09-19 00:58:50 NP-complete problems Graph coloring Independent set NP-complete Clique Vertex cover NP Clique cover problem Domatic number Theoretical computer science Graph theory Computational complexity theory
675	Fast Algorithms for Computing Tree LCS Shay Mozes1 Dekel Tsur2 Oren Weimann3 Michal Ziv-Ukelson2 1 Brown University Add to Reading List Source URL: www.cs.ucr.edu Language: English - Date: 2008-06-17 10:13:00 Analysis of algorithms Time complexity Tree Spanning tree NP-complete problems Theoretical computer science Computational complexity theory Applied mathematics
676	Sharper Upper and Lower Bounds for an Approximation Scheme for Consensus-Pattern Ian Harrower School of Computer Science University of Waterloo Add to Reading List Source URL: www.cs.ucr.edu Language: English - Date: 2005-07-08 16:21:37 Approximation algorithm Computational complexity theory Substring Computing Hamming distance Optimization problem Mathematics Theoretical computer science String
677	Probabilistic Design: A Survey of Probabilistic CMOS Technology and Future Directions for Terascale IC Design Lakshmi N. B. Chakrapani, Jason George, Bo Marr, and Bilge E. S. Akgul, and Krishna V. Palem Center for Resear Add to Reading List Source URL: www.ece.rice.edu Language: English - Date: 2012-08-15 22:03:08 CMOS Electronic design Randomized algorithm PP Probabilistic design Normal distribution Theoretical computer science Computational complexity theory Applied mathematics
678	Randomized and Parameterized Algorithms for the Closest String Problem Zhi-Zhong Chen Tokyo Denki University Joint with Add to Reading List Source URL: www.cs.ucr.edu Language: English - Date: 2014-06-14 17:20:02 Analysis of algorithms NP-complete problems Closest string Randomized algorithm String Time complexity Algorithm 2-satisfiability NP Theoretical computer science Computational complexity theory Applied mathematics
679	Eﬃciently Decodable Error-Correcting List Disjunct Matrices and Applications (Extended Abstract) Hung Q. Ngo1 , Ely Porat2, and Atri Rudra1, 2 Add to Reading List Source URL: www.cse.buffalo.edu Language: English - Date: 2014-06-23 10:33:47 Computational complexity theory Applied mathematics Disjunct matrix Coding theory Error detection and correction Group testing List decoding Matrix Matrices Theoretical computer science Mathematics Combinatorics
680	A GRAPH-SEARCH APPROACH ON RESOURCE-CONSTRAINED SCHEDULING PROBLEMS AND ITS APPLICATION TO ADVANCED DRIVER ASSISTANCE SYSTEMS Christoph Endres1 , Christian M¨uller1 1 German Add to Reading List Source URL: simtd.de Language: English - Date: 2014-02-24 04:48:29 Computational complexity theory Ant colony optimization algorithms Algorithm Optimization problem Scheduling Linear programming Mathematical optimization SL Genetic algorithm Applied mathematics Theoretical computer science Operations research

UPDATE